The Dunford–Pettis property, the Gelfand–Phillips property, and L-sets
نویسندگان
چکیده
منابع مشابه
COUNTABLE COMPACTNESS AND THE LINDEL¨OF PROPERTY OF L-FUZZY SETS
In this paper, countable compactness and the Lindel¨of propertyare defined for L-fuzzy sets, where L is a complete de Morgan algebra. Theydon’t rely on the structure of the basis lattice L and no distributivity is requiredin L. A fuzzy compact L-set is countably compact and has the Lindel¨ofproperty. An L-set having the Lindel¨of property is countably compact if andonly if it is fuzzy compact. ...
متن کاملA convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملOn Property (A) and the socle of the $f$-ring $Frm(mathcal{P}(mathbb R), L)$
For a frame $L$, consider the $f$-ring $ mathcal{F}_{mathcal P}L=Frm(mathcal{P}(mathbb R), L)$. In this paper, first we show that each minimal ideal of $ mathcal{F}_{mathcal P}L$ is a principal ideal generated by $f_a$, where $a$ is an atom of $L$. Then we show that if $L$ is an $mathcal{F}_{mathcal P}$-completely regular frame, then the socle of $ mathcal{F}_{mathcal P}L$ consists of those $f$...
متن کاملcountable compactness and the lindel¨of property of l-fuzzy sets
in this paper, countable compactness and the lindel¨of propertyare defined for l-fuzzy sets, where l is a complete de morgan algebra. theydon’t rely on the structure of the basis lattice l and no distributivity is requiredin l. a fuzzy compact l-set is countably compact and has the lindel¨ofproperty. an l-set having the lindel¨of property is countably compact if andonly if it is fuzzy compact. ...
متن کاملDetermining Sets, Resolving Sets, and the Exchange Property
A subset U of vertices of a graph G is called a determining set if every automorphism of G is uniquely determined by its action on the vertices of U . A subset W is called a resolving set if every vertex in G is uniquely determined by its distances to the vertices of W . Determining (resolving) sets are said to have the exchange property in G if whenever S and R are minimal determining (resolvi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2006
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm106-2-11